Quantifying DDS-cerberus network control overhead
نویسندگان
چکیده
Abstract Securing distributed device communication is critical because the private industry and military depend on these resources. One area that adversaries target middleware, which medium connects different systems. This paper evaluates a novel security layer, DDS-Cerberus (DDS-C), protects in-transit data improves efficiency data-first distribution research contributes robotics operating system testbed designs multifactorial performance-based experiment to evaluate DDS-C by assessing total packet traffic generated in network. The performance follows 2:1 publisher subscriber node ratio, varying number of subscribers nodes from three eighteen. By categorizing network into either message , or discovery+ with Quality Service (QoS) best effort reliable, mean has minimal impact Data Distribution (DDS) operations compared other traffic. results reveal applying representative does not performance.
منابع مشابه
Alternative for Quantifying Field-Overhead Damages
The context of delays significantly affects delay responsibility. Among other things, recoverable damages for a delay should be related to the timing of the corresponding delay and its effect on indirect costs. This paper presents an alternative and integrated approach for quantifying and apportioning delay responsibility. It considers the context of a delay in terms of its timing and the degre...
متن کاملReducing Data and Control Transfer Overhead through Network-Interface Support
This paper describes generic NI-level mechanisms that reduce data and control transfer overheads in user-level communication systems. These mechanisms reduce polling overhead without reducing throughput, improve multicast performance, and reduce the frequency of network and timer interrupts. They have all been implemented in a family of low-level Myrinet communication systems. We illustrate the...
متن کاملNetwork Synchronization with Polylogarithmic Overhead
The synchronizer is a simulation methodology for simulating a synchronous network by an asynchronous one, thus enabling the execution of a synchronous algorithm on an asynchronous network. Previously known synchronizers require each processor in the entire network G(V; E) to participate in each pulse of the synchronization process. As a result, the communication overhead of existing synchro-niz...
متن کاملOverhead-Optimized Gamma Network Codes
We design a network coding scheme with minimum reception overhead and linear encoding/decoding complexity.
متن کاملQuantifying and Evaluating the Space Overhead in C++ Memory Layouts
This paper develops a formalism that precisely characterizes when class tables are required for C++ memory layouts. A memory layout is a particular choice of data structures for implementing run-time support for object-oriented languages. We use this formalism and other techniques to quantify and evaluate, on a set of benchmarks, the space overhead for a set of C++ memory layouts. In particular...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Supercomputing
سال: 2022
ISSN: ['0920-8542', '1573-0484']
DOI: https://doi.org/10.1007/s11227-022-04770-3